Computational Methods using Genetic Algorithms for Obtaining Stackelberg-Nash Solutions to Decentralized Two-level Zero-one Programming Problems
نویسندگان
چکیده
منابع مشابه
Computational Methods for Two-Level 0-1 Programming Problems through Distributed Genetic Algorithms
In this paper, we consider a two-level 0-1 programming problem in which there is not coordination between the decision maker (DM) at the upper level and the decision maker at the lower level. We propose a revised computational method that solves problems related to computational methods for obtaining the Stackelberg solution. Specifically, in order to improve the computational accuracy of appro...
متن کاملDecentralized Two-Level 0-1 Programming through Distributed Genetic Algorithms
In this paper, we consider decentralized two-level 0-1 programming problems in which there are one decision maker (the leader) at the upper level and two or more decision makers (the followers) at the lower level, and decision variables of each decision maker are 0-1 variables. We assume that there is coordination among the followers while between the leader and the group of all the followers, ...
متن کاملStackelberg Solutions to Noncooperative Two-Level Nonlinear Programming Problems through Evolutionary Multi-Agent Systems
In the real world, we often encounter situations where there are two or more decision makers in an organization with a hierarchical structure, and they make decisions in turn or at the same time so as to optimize their objective functions. Decision making problems in decentralized organizations are often modeled as Stackelberg games (Simaan & Cruz Jr., 1973), and they are formulated as two-leve...
متن کاملStackelberg solutions to noncooperative two-level nonlinear programming problems through particle swarm optimization
In this paper, we focus on two-level nonlinear programming problems with no coordination between the decision maker at the upper level ( the leader) and the decision maker at the lower level (the follower), and propose a computational method through particle swarm optimization (PSO) for obtaining Stackelberg solutions to two-level nonlinear programming problems. Furthermore, we carry out numeri...
متن کاملCompetitive newsvendor problems with the same Nash and Stackelberg solutions
Consider two newsvendors: (i) they compete satisfying substitutable demands searching Nash equilibrium or (ii) one is the leader deciding first, the other responds optimally playing a Stackelberg game. The leader profits more than she does in (i). We present conditions under which the leader’s profit does not improve from (i) to (ii). © 2006 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Japan Society for Fuzzy Theory and Systems
سال: 1999
ISSN: 0915-647X,2432-9932
DOI: 10.3156/jfuzzy.11.5_104